翻訳と辞書 Words near each other ・ Ternary acid ・ Ternary commutator ・ Ternary complex ・ Ternary compound ・ Ternary computer ・ Ternary cubic ・ Ternary equivalence relation ・ Ternary fission ・ Ternary form ・ Ternary Golay code ・ Ternary numeral system ・ Ternary operation ・ Ternary plot ・ Ternary quartic ・ Ternary relation ・ Ternary search ・ Ternary search tree ・ Ternary signal ・ Ternary tree ・ Ternas ・ Ternat ・ Ternat, Haute-Marne ・ Ternate ・ Ternate (disambiguation) ・ Ternate City ・ Ternate language ・ Ternate Sultanate ・ Ternate, Cavite ・ Ternate, Lombardy ・ Ternatin Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Ternary search ： ウィキペディア英語版 Ternary search A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function. A ternary search determines either that the minimum or maximum cannot be in the first third of the domain or that it cannot be in the last third of the domain, then repeats on the remaining two-thirds. A ternary search is an example of a divide and conquer algorithm (see search algorithm). == The function == Assume we are looking for a maximum of ''f''(''x'') and that we know the maximum lies somewhere between ''A'' and ''B''. For the algorithm to be applicable, there must be some value ''x'' such that * for all ''a'',''b'' with A ≤ ''a'' < ''b'' ≤ ''x'', we have ''f''(''a'') < ''f''(''b''), and * for all ''a'',''b'' with ''x'' ≤ ''a'' < ''b'' ≤ B, we have ''f''(''a'') > ''f''(''b''). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ternary search」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.